1635A - Min Or Sum - CodeForces Solution


bitmasks greedy *800

Please click on ads to support us..

Python Code:

t = int(input())
for _ in range(t):
    n = int(input())
    lis = list(map(int, input().split()))
    ans = 0
    for i in lis:
        ans |= i
    print(ans)

C++ Code:

#include <bits/stdc++.h>

using namespace std;

using ll = long long;
#define ios ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
//const ll mod = 1e9 + 9;
const ll len = 4e7 + 1;
//const ll len1 = 1e8;
#define pb push_back

int a[100010];

void sol() {
    ll i, j = 0, n, ans = 0, k = 0, m, p, q, w, e, r;
    cin >> n;
    for (i = 0; i < n; i++) {
        cin >> q;
        k |= q;
    }
    cout << k << "\n";
}

int main() {
//#pragma comment(linker, "/STACK:1073741824")
//#pragma warning(disable : 4996)
    ios;
    int n;
    cin >> n;
    for (int i = 0; i < n; i++) {
        sol();
    }
    return 0;
}


Comments

Submit
0 Comments
More Questions

80A - Panoramix's Prediction
1354B - Ternary String
122B - Lucky Substring
266B - Queue at the School
1490A - Dense Array
1650B - DIV + MOD
1549B - Gregor and the Pawn Game
553A - Kyoya and Colored Balls
1364A - XXXXX
1499B - Binary Removals
1569C - Jury Meeting
108A - Palindromic Times
46A - Ball Game
114A - Cifera
776A - A Serial Killer
25B - Phone numbers
1633C - Kill the Monster
1611A - Make Even
1030B - Vasya and Cornfield
1631A - Min Max Swap
1296B - Food Buying
133A - HQ9+
1650D - Twist the Permutation
1209A - Paint the Numbers
1234A - Equalize Prices Again
1613A - Long Comparison
1624B - Make AP
660B - Seating On Bus
405A - Gravity Flip
499B - Lecture